Degree Powers in Graphs with Forbidden Subgraphs
نویسندگان
چکیده
منابع مشابه
Degree Powers in Graphs with Forbidden Subgraphs
For every real p > 0 and simple graph G, set f (p,G) = ∑ u∈V (G) d (u) , and let φ (r, p, n) be the maximum of f (p,G) taken over all Kr+1-free graphs G of order n. We prove that, if 0 < p < r, then φ (r, p, n) = f (p, Tr (n)) , where Tr (n) is the r-partite Turan graph of order n. For every p ≥ r + ⌈√ 2r ⌉ and n large, we show that φ (p, n, r) > (1 + ε) f (p, Tr (n)) for some ε = ε (r) > 0. Ou...
متن کاملGraphs with Forbidden Subgraphs
Many graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraph they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain. For example, a tree can be defined as a connected graph which contains no cycles, and Kuratowski [22] characterized plan...
متن کاملDegree Powers in Graphs with a Forbidden Even Cycle
Let Cl denote the cycle of length l. For p > 2 and integer k > 1, we prove that the function
متن کاملDegree powers in graphs with forbidden even cycle
Let Cl denote the cycle of length l: For p 2 and integer k 1; we prove that the function (k; p; n) = max <: X u2V (G) d (u) : G is a graph of order n containing no C2k+2 =; satis es (k; p; n) = knp (1 + o (1)) : This settles a conjecture of Caro and Yuster. Our proof is based on a new su¢ cient condition for long paths, that may be useful in other applications as well.
متن کاملUniversal Graphs (with Forbidden Subgraphs)
The graph theoretic problem of identifying the finite sets C of constraint graphs for which there is a countable universal C-free graph is closely related to the problem of determining for which sets C the model companion T ∗ C of the theory of C-free graphs is א0-categorical, and this leads back to combinatorics. Little is known about these theories from any other perspective, such as stabilit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2004
ISSN: 1077-8926
DOI: 10.37236/1795